On the Convergence of Iterated Exponentiation—i
نویسنده
چکیده
1. R. L. Adler & T. J. Rivlin. "Ergodic and Mixing Properties of Chebyshev Polynomials." Proa. Amer. Math. Soc. 15 (1964) :79'4-7'96. 2. P. Johnson & A. Sklar. "Recurrence and Dispersion under Iteration of Cebysev Polynomials." To appear. 3. C.H. Kimberling. "Four Composition Identities for Chebyshev Polynomials." This issue, pp. 353-369. 4. T. J. Rivlin. The Chebyshev Polynomials. New York: Wiley, 1974. 5. A. Zygmund. Trigonometric Series. I. Cambridge: Cambridge Univ. Press, 1969.
منابع مشابه
Efficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملD-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملOn $I$-statistical and $I$-lacunary statistical convergence of order $alpha$
In this paper, following a very recent and new approach, we further generalize recently introduced summability methods, namely, $I$-statistical convergence and $I$-lacunary statistical convergence (which extend the important summability methods, statistical convergence and lacunary statistical convergence using ideals of $mathbb{N}$) and introduce the notions of $I$-statis...
متن کاملConstant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
We study the complexity of arithmetic in finite fields of characteristic two, F2n . We concentrate on the following two problems: • Iterated Multiplication: Given α1, α2, . . . , αt ∈ F2n , compute α1 · α2 · · ·αt ∈ F2n . • Exponentiation: Given α ∈ F2n and a t-bit integer k, compute α k ∈ F2n . First, we consider the explicit realization of the field F2n as F2[x]/(x 2·3l +x3 l +1) ' F2n , wher...
متن کاملThe Chaos Game on a General Iterated Function System from a Topological Point of View
We investigate combinatorial issues relating to the use of random orbit approximations to the attractor of an iterated function system with the aim of clarifying the role of the stochastic process during generation the orbit. A Baire category counterpart of almost sure convergence is presented; and a link between topological and probabilistic methods is observed.
متن کامل